type compress/flate.tableEntry
69 uses
compress/flate (current package)
deflatefast.go#L138: type tableEntry struct {
deflatefast.go#L144: cur tableEntry
deflatefast.go#L145: prev tableEntry
level1.go#L10: table [tableSize]tableEntry
level1.go#L68: var candidate tableEntry
level1.go#L79: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L83: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L93: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L97: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L158: e.table[hashLen(cv, tableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level1.go#L172: e.table[prevHash] = tableEntry{offset: o}
level1.go#L176: e.table[currHash] = tableEntry{offset: o + 2}
level2.go#L15: table [l2TableSize]tableEntry
level2.go#L73: var candidate tableEntry
level2.go#L83: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L88: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level2.go#L98: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L138: e.table[hashLen(cv, l2TableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level2.go#L147: e.table[nextHash] = tableEntry{offset: e.cur + i}
level2.go#L151: e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
level2.go#L155: e.table[nextHash] = tableEntry{offset: e.cur + i + 4}
level2.go#L166: e.table[prevHash] = tableEntry{offset: o}
level2.go#L167: e.table[prevHash2] = tableEntry{offset: o + 1}
level2.go#L170: e.table[currHash] = tableEntry{offset: o + 2}
level3.go#L77: var candidate tableEntry
level3.go#L90: e.table[nextHash] = tableEntryPrev{prev: candidates.cur, cur: tableEntry{offset: s + e.cur}}
level3.go#L160: cur: tableEntry{offset: e.cur + t},
level3.go#L171: cur: tableEntry{offset: e.cur + i}}
level3.go#L180: cur: tableEntry{offset: e.cur + s - 2},
level3.go#L187: cur: tableEntry{offset: e.cur + s - 1},
level3.go#L195: cur: tableEntry{offset: s + e.cur},
level4.go#L10: table [tableSize]tableEntry
level4.go#L11: bTable [tableSize]tableEntry
level4.go#L92: entry := tableEntry{offset: s + e.cur}
level4.go#L153: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: s + e.cur}
level4.go#L154: e.bTable[hashLen(cv, tableBits, hashLongBytes)] = tableEntry{offset: s + e.cur}
level4.go#L163: t := tableEntry{offset: i + e.cur}
level4.go#L164: t2 := tableEntry{offset: t.offset + 1}
level4.go#L172: t := tableEntry{offset: i + e.cur}
level4.go#L173: t2 := tableEntry{offset: t.offset + 1}
level4.go#L186: e.table[prevHashS] = tableEntry{offset: o}
level4.go#L187: e.bTable[prevHashL] = tableEntry{offset: o}
level5.go#L11: table [tableSize]tableEntry
level5.go#L102: entry := tableEntry{offset: s + e.cur}
level5.go#L114: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L116: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level5.go#L133: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L135: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level5.go#L147: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L149: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level5.go#L238: t := tableEntry{offset: i + e.cur}
level5.go#L245: t = tableEntry{offset: t.offset + 1}
level5.go#L251: t = tableEntry{offset: t.offset + 1}
level5.go#L258: t := tableEntry{offset: i + e.cur}
level5.go#L259: t2 := tableEntry{offset: t.offset + 1}
level5.go#L272: e.table[prevHashS] = tableEntry{offset: o}
level5.go#L274: eLong.cur, eLong.prev = tableEntry{offset: o}, eLong.cur
level6.go#L11: table [tableSize]tableEntry
level6.go#L101: entry := tableEntry{offset: s + e.cur}
level6.go#L116: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L118: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level6.go#L137: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L139: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level6.go#L153: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L155: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level6.go#L267: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: i + e.cur}
level6.go#L269: eLong.cur, eLong.prev = tableEntry{offset: i + e.cur}, eLong.cur
level6.go#L277: t := tableEntry{offset: i + e.cur}
level6.go#L278: t2 := tableEntry{offset: t.offset + 1}